n, a , b = map(int, input().split())
arr = [int(c) for c in input().split()]
arr.sort()
print(arr[-a]-arr[-a-1])/// DuongSoSad
#pragma GCC optimize(" unroll-loops")
#pragma gcc optimize("Ofast")
#pragma GCC optimization("Ofast")
#pragma optimize(Ofast)
#include <bits/stdc++.h>
#define el cout << '\n'
#define eps 0.0000001
#define maxn 2005
using namespace std;
int n , a , b , h[maxn];
void inp()
{
cin >> n >> a >> b;
for(int i = 1;i <= n; ++i) cin >> h[i];
sort(h + 1 , h + n + 1 , greater<int> ());
}
void solve()
{
int i = 1 , res = 0 , tmp;
for(;i <= a; ++i) res = h[i];
tmp = h[i];
(res == tmp) ? cout << 0 : cout << res - tmp;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
inp();
solve();
return 0;
}
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |